Decomposition and convergence for tree martingales

AbstractIn this paper, the authors firstly construct a graph-theoretic decomposition of an index set for tree martingales, and based on this decomposition, they give a locally finite tree martingale’s notion and a tree martingale decomposition theorem. Secondly, they establish some relations between the locally finite tree martingales and the multiparameter martingales, and furthermore the convergence of tree martingales is shown by using the multiparameter martingale theory of Cairoli–Walsh. Finally, with some mild conditions, two inequalities for tree martingales are obtained by using their decomposition theorem and multiparameter martingale theory

Hidden-bottom molecular states from Σb(∗)B(∗)−ΛbB(∗)\Sigma^{(*)}_bB^{(*)}-\Lambda_bB^{(*)} interaction

In this work, we study possible hidden-bottom molecular pentaquarks $P_b$ from coupled-channel $\Sigma^{(*)}_bB^{(*)}-\Lambda_bB^{(*)}$ interaction in the quasipotential Bethe-Salpeter equation approach. In isodoublet sector with $I=1/2$, with the same reasonable parameters the interaction produces seven molecular states, a state near $\Sigma_bB$ threshold with spin parity $J^P=1/2^-$, a state near $\Sigma^*_bB$ threshold with $3/2^-$, two states near $\Sigma_bB^*$ threshold with $1/2^-$ and $3/2^-$, and three states near $\Sigma_b^*B^*$ threshold with $1/2^-$, $3/2^-$, and $5/2^-$. The results suggest that three states near $\Sigma_b^* B^*$ threshold and two states near $\Sigma_b B^*$ threshold are very close, respectively, which may be difficult to distinguish in experiment without partial wave analysis. Compared with the hidden-charm pentaquark, the $P_b$ states are relatively narrow with widths at an order of magnitude of 1 MeV or smaller. The importance of each channel considered is also discussed, and it is found that the $\Lambda_b B^*$ channel provides important contribution for the widths of those states. In isoquartet sector with $I=3/2$, cutoff should be considerably enlarged to achieve bound states from the interaction, which makes the existence of such states unreliable. The results in the current work are helpful for searching for hidden-bottom molecular pentaquarks in future experiments, such as the COMPASS, J-PARC, and the Electron Ion Collider in China (EicC).Comment: 8 pages, 3 figure

The Complexity of Distributed Edge Coloring with Small Palettes

The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1. We simplify the \emph{round elimination} technique of Brandt et al. and prove that $(2\Delta-2)$-edge coloring requires $\Omega(\log_\Delta \log n)$ time w.h.p. and $\Omega(\log_\Delta n)$ time deterministically, even on trees. The simplified technique is based on two ideas: the notion of an irregular running time and some general observations that transform weak lower bounds into stronger ones. 2. We give a randomized edge coloring algorithm that can use palette sizes as small as $\Delta + \tilde{O}(\sqrt{\Delta})$, which is a natural barrier for randomized approaches. The running time of the algorithm is at most $O(\log\Delta \cdot T_{LLL})$, where $T_{LLL}$ is the complexity of a permissive version of the constructive Lovasz local lemma. 3. We develop a new distributed Lovasz local lemma algorithm for tree-structured dependency graphs, which leads to a $(1+\epsilon)\Delta$-edge coloring algorithm for trees running in $O(\log\log n)$ time. This algorithm arises from two new results: a deterministic $O(\log n)$-time LLL algorithm for tree-structured instances, and a randomized $O(\log\log n)$-time graph shattering method for breaking the dependency graph into independent $O(\log n)$-size LLL instances. 4. A natural approach to computing $(\Delta+1)$-edge colorings (Vizing's theorem) is to extend partial colorings by iteratively re-coloring parts of the graph. We prove that this approach may be viable, but in the worst case requires recoloring subgraphs of diameter $\Omega(\Delta\log n)$. This stands in contrast to distributed algorithms for Brooks' theorem, which exploit the existence of $O(\log_\Delta n)$-length augmenting paths

Possible molecular dibaryons with csssqqcsssqq quarks and their baryon-antibaryon partners

In this work, we systematically investigate the charmed-strange dibaryon systems with $csssqq$ quarks and their baryon-antibaryon partners from the interactions $\Xi^{(',*)}_{c}\Xi^{(*)}$, $\Omega^{(*)}_c\Lambda$, $\Omega^{(*)}_c\Sigma^{(*)}$, $\Lambda_c\Omega$ and $\Sigma^{(*)}_c\Omega$ and their baryon-antibaryon partners from interactions $\Xi^{(',*)}_{c}\bar{\Xi}^{(*)}$, $\Omega^{(*)}_c\bar{\Lambda}$, $\Omega^{(*)}_c\bar{\Sigma}^{(*)}$, $\Lambda_c\bar{\Omega}$ and $\Sigma^{(*)}_c\bar{\Omega}$. The potential kernels are constructed with the help of effective Lagrangians under SU(3), heavy quark, and chiral symmetries to describe these interactions. To search for possible molecular states, the kernels are inserted into the quasipotential Bethe-Salpeter equation, which is solved to find poles from scattering amplitude. The results suggest that 36 and 24 bound states can be found in the baryon-baryon and baryon-antibaryon interactions, respectively. However, much large values of parameter $\alpha$ are required to produce the bound states from the baryon-antibaryon interactions, which questions the existence of these bound states. Possible coupled-channel effect are considered in the current work to estimate the couplings of the molecular states to the channels considered.Comment: 13 pages, 5 figures. arXiv admin note: text overlap with arXiv:2208.1196

Y(4626) as a molecular state from interaction Ds∗Dˉs1(2536)−DsDˉs1(2536){D}^*_s\bar{D}_{s1}(2536)-{D}_s\bar{D}_{s1}(2536)

Recently, a new structure $Y(4626)$ was reported by the Belle Colloboration in the process $e^+e^-\to D_s^+D_{s1}(2536)^-$. In this work, we propose an assignment of the $Y(4626)$ as a ${D}^*_s\bar{D}_{s1}(2536)$ molecular state, which decays into the $D_s^+D_{s1}(2536)^-$ channel through a coupling between ${D}^*_s\bar{D}_{s1}(2536)$ and ${D}_s\bar{D}_{s1}(2536)$ channels. With the help of the heavy quark symmetry, the potential of the interaction ${D}^*_s\bar{D}_{s1}(2536)-{D}_s\bar{D}_{s1}(2536)$ is constructed within the one-boson-exchange model, and inserted into the quasipotential Bethe-Salpeter equation. The pole of obtained scattering amplitude is searched for in the complex plane, which corresponds to a molecular state from the interaction ${D}^*_s\bar{D}_{s1}(2536)-{D}_s\bar{D}_{s1}(2536)$. The results suggest that a pole is produced near the ${D}^*_s\bar{D}_{s1}(2536)$ threshold, which exhibits as a peak in the invariant mass spectrum of the ${D}_s\bar{D}_{s1}(2536)$ channel at about 4626 MeV. It obviously favors the $Y(4265)$ as a ${D}^*_s\bar{D}_{s1}(2536)$ molecular state. In the same model, other molecular states from the interaction ${D}^*_s\bar{D}_{s1}(2536)-{D}_s\bar{D}_{s1}(2536)$ are also predicted, which can be checked in future experiments.Comment: 7 pages, 2 figure

The Energy Complexity of Broadcast

Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens; idle time and computation are free. In this paper we investigate the energy complexity of fundamental communication primitives such as broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work include: 1. The energy complexity of broadcast in a multi-hop network is intimately connected to the time complexity of leader election in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, we need $\Omega(\log n)$ and $\Omega(\log^2 n)$ energy, respectively. 2. The energy lower bounds above can almost be achieved, given sufficient ($\Omega(n)$) time. In the CD and No-CD models we can solve broadcast using $O(\frac{\log n\log\log n}{\log\log\log n})$ energy and $O(\log^3 n)$ energy, respectively. 3. The complexity measures of Energy and Time are in conflict, and it is an open problem whether both can be minimized simultaneously. We give a tradeoff showing it is possible to be nearly optimal in both measures simultaneously. For any constant $\epsilon>0$, broadcast can be solved in $O(D^{1+\epsilon}\log^{O(1/\epsilon)} n)$ time with $O(\log^{O(1/\epsilon)} n)$ energy, where $D$ is the diameter of the network